منابع مشابه
Links between eccentricity forcing and the 100,000-year glacial cycle
Variations in the eccentricity (100,000 yr), obliquity (41,000 yr) and precession (23,000 yr) of Earth’s orbit have been linked to glacial–interglacial climate cycles. It is generally thought that the 100,000-yr glacial cycles of the past 800,000 yr are a result of orbital eccentricity1–4. However, the eccentricity cycle produces negligible 100-kyr power in seasonal or mean annual insolation, a...
متن کاملSpectrum of 100-kyr glacial cycle: orbital inclination, not eccentricity.
Spectral analysis of climate data shows a strong narrow peak with period approximately 100 kyr, attributed by the Milankovitch theory to changes in the eccentricity of the earth's orbit. The narrowness of the peak does suggest an astronomical origin; however the shape of the peak is incompatible with both linear and nonlinear models that attribute the cycle to eccentricity or (equivalently) to ...
متن کاملEccentricity sequences and eccentricity sets in digraphs
The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its vertices given in nondecreasing order. A sequence of positive integers is a digraphical eccentric sequence if it is the eccentricity sequence of some digraph. A set of positive integers S is a digraphical eccentric set ...
متن کاملLocal Limit Theorems for Ladder Epochs
Let S0 = 0, {Sn}n≥1 be a random walk generated by a sequence of i.i.d. random variables X1,X2, ... and let τ− := min {n ≥ 1 : Sn ≤ 0} and τ := min {n ≥ 1 : Sn > 0}. Assuming that the distribution of X1 belongs to the domain of attraction of an α-stable law, α 6= 1, we study the asymptotic behavior of P(τ± = n) as n → ∞.
متن کاملEccentricity approximating trees
Using the characteristic property of chordal graphs that they are the intersection graphs of subtrees of a tree, Erich Prisner showed that every chordal graph admits an eccentricity 2approximating spanning tree. That is, every chordal graph G has a spanning tree T such that eccT (v) − eccG(v) ≤ 2 for every vertex v, where eccG(v) (eccT (v)) is the eccentricity of a vertex v in G (in T , respect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geological Magazine
سال: 1880
ISSN: 0016-7568,1469-5081
DOI: 10.1017/s0016756800148307